Closed orders and closed graphs
نویسنده
چکیده
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
منابع مشابه
$Z_k$-Magic Labeling of Some Families of Graphs
For any non-trivial abelian group A under addition a graph $G$ is said to be $A$-textit{magic} if there exists a labeling $f:E(G) rightarrow A-{0}$ such that, the vertex labeling $f^+$ defined as $f^+(v) = sum f(uv)$ taken over all edges $uv$ incident at $v$ is a constant. An $A$-textit{magic} graph $G$ is said to be $Z_k$-magic graph if the group $A$ is $Z_k$ the group of integers modulo $k...
متن کاملOn 2 - e . c . line - critical graphs ∗
We continue the study of graphs defined by a certain adjacency property by investigating the n-existentially closed line-critical graphs. We classify the 1-e.c. line-critical graphs and give examples of 2-e.c. line-critical graphs for all orders ≥ 9.
متن کاملCharacterising subclasses of perfect graphs with respect to partial orders related to edge contraction
Characterising graph classes by forbidding a set of graphs has been a common feature in graph theory for many years. Up to date many classes have been char-acterised with respect to the induced subgraph relation and there are a plethora of results regarding graph classes closed under the minor relation. We consider the characterisation of graph classes closed under partial orders including edge...
متن کاملOn characterizations of weakly $e$-irresolute functions
The aim of this paper is to introduce and obtain some characterizations of weakly $e$-irresolute functions by means of $e$-open sets defined by Ekici [6]. Also, we look into further properties relationships between weak $e$-irresoluteness and separation axioms and completely $e$-closed graphs.
متن کاملMaximum degree in minor-closed classes of graphs
Given a class of graphs G closed under taking minors, we study the maximum degree ∆n of random graphs from G with n vertices. We prove several lower and upper bounds that hold with high probability. Among other results, we find classes of graphs providing orders of magnitude for ∆n not observed before, such us log n/ log log log n and log n/ log log log log n. © 2016 Elsevier Ltd. All rights re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016